Queue
Operates on a First In, First Out (FIFO) principle
Stack
Operates on a Last In, Last Out (LIFO) principle
Bubble Sort
Bubble Sort Visualizer
Selection Sort
Selection Sort Visualizer
Merge Sort
Merge Sort Visualizer
Sliding Window Sort
Sliding Window Visualizer
Binary Search
Binary Search Visualizer
Linked List
Linked List Visualizer
Quick Sort
Quick Sort Visualizer
Two Pointer Sort
Two Pointer Visualizer
Sieve of Eratosthenes
Sieve of Eratosthenes Visualizer
Linked List Visualization
OVERVIEW
A Linked List is a linear data structure consisting of nodes, where each node contains a value and a reference to the next node in the sequence. Unlike arrays, linked lists provide dynamic memory allocation and efficient insertions and deletions.
Operations
Insertion: Adds a new node at the beginning, end, or a specific position in the linked list.
Deletion: Removes a node from the beginning, end, or a specific position in the linked list.
Traversal: Accesses each node sequentially to process the data stored in the linked list.
Search: Finds a node containing a specific value in the linked list.
Update: Modifies the data of a specific node in the linked list.
Terminologies
Node: A fundamental unit of a linked list containing data and a reference (or pointer) to the next node.
Head: The first node in a linked list. It serves as the starting point for traversal.
Tail: The last node in a linked list, which usually points to NULL (in singly linked lists).
Pointer: A reference to another node in the linked list, helping in navigation.
Linked List Types: Includes singly linked list, doubly linked list, and circular linked list.